Reformulating Global Constraints: The Slideand RegularConstraints
نویسندگان
چکیده
Global constraints are useful for modelling and reasoning about real-world combinatorial problems. Unfortunately, developing propagation algorithms to reason about global constraints efficiently and effectively is usually a difficult and complex process. In this paper, we show that reformulation may be helpful in building such propagators. We consider both hard and soft forms of two powerful global constraints, Slide and Regular. These global constraints are useful to represent a wide range of problems like rostering and scheduling where we have a sequence of decision variables and some constraint that holds along the sequence. We show that the different forms of Slide and Regular can all be reformulated as each other. We also show that reformulation is an effective method to incorporate such global constraints within an existing constraint toolkit. Finally, this study provides insight into the close relationship between these two important global constraints.
منابع مشابه
Analytic Solutions to Optimal Control Problems with Constraints
In this paper, the analytic solutions to constrained optimal control problems are considered. A novel approach based on canonical duality theory is developed to derive the analytic solution of this problem by reformulating a constrained optimal control problem into a global optimization problem. A differential flow is presented to deduce some optimality conditions for solving global optimizatio...
متن کاملReformulating Positive Table Constraints Using Functional Dependencies
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraints of large arity into a conjunction of lower arity constraints. Our approach exploits functional dependencies. We study the complexity of finding reformulations that either minimize the memory size or arity of a const...
متن کاملGap functions for quasi-equilibria
An approach for solving quasi-equilibrium problems (QEPs) is proposed relying on gap functions, which allow reformulating QEPs as global optimization problems. The (generalized) smoothness properties of a gap function are analysed and an upper estimates of its Clarke directional derivative is given. Monotonicity assumptions on both the equilibrium and constraining bifunctions are a key tool to ...
متن کاملSmoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints
The equilibrium problem with equilibrium constraints (EPEC) can be looked on as a generalization of Nash equilibrium problem (NEP) and the mathematical program with equilibrium constraints (MPEC) whose constraints contain a parametric variational inequality or complementarity system. In this paper, we particularly consider a special class of EPECs where a common parametric P-matrix linear compl...
متن کامل